A Software Framework for Solving Combinatorial Optimization Tasks

نویسندگان

  • ISTVAN-GERGELY CZIBULA
  • GABRIELA CZIBULA
چکیده

Due to the major practical importance of combinatorial optimization problems, many approaches for tackling them have been developed. As the problem of intelligent solution generation can be approached with reinforcement learning techniques, we aim at presenting in this paper a programming interface for solving combinatorial optimization problems using reinforcement learning techniques. The advantages of the proposed framework are emphasized, highlighting the potential of using reinforcement learning for solving optimization tasks. An experiment for solving the bidimensional protein folding problem developed using the designed interface is also presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Author's Personal Copy Four-layer Framework for Combinatorial Optimization Problems Domain Q

Four-layer framework for combinatorial optimization problems/models domain is suggested for applied problems structuring and solving: (1) basic combinatorial models and multicriteria decision making problems (e.g., clustering, knapsack problem, multiple choice problem, multicriteria ranking, assignment/allocation); (2) composite models/procedures (e.g., multicriteria combinatorial problems, mor...

متن کامل

OptLets: A Generic Framework for Solving Arbitrary Optimization Problems

Meta-heuristics are an effective paradigm for solving large-scale combinatorial optimization problems. However, the development of such algorithms is often very time-consuming as they have to be designed for a concrete problem class with little or no opportunity for reuse. In this paper, we present a generic software framework that is able to handle different types of combinatorial optimization...

متن کامل

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

Bucket Elimination: A Unifying Framework for Reasoning

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional satis ability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination for solving linear equalities and inequalities, and dynamic programming for combinatorial optimiza...

متن کامل

M best solutions over Graphical Models

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. In particular, it can be used for any combinatorial optimization task such as finding most probable configurations in a Bayesian network. In this paper we present a new algorithm elim-m-opt, extending bucket elimination for the task of finding m best solut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011